Termination w.r.t. Q of the following Term Rewriting System could not be shown:

Q restricted rewrite system:
The TRS R consists of the following rules:

-2(x, 0) -> x
-2(s1(x), s1(y)) -> -2(x, y)
+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
*2(x, 0) -> 0
*2(x, s1(y)) -> +2(x, *2(x, y))
p1(s1(x)) -> x
f1(s1(x)) -> f1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

Q is empty.


QTRS
  ↳ Non-Overlap Check

Q restricted rewrite system:
The TRS R consists of the following rules:

-2(x, 0) -> x
-2(s1(x), s1(y)) -> -2(x, y)
+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
*2(x, 0) -> 0
*2(x, s1(y)) -> +2(x, *2(x, y))
p1(s1(x)) -> x
f1(s1(x)) -> f1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

Q is empty.

The TRS is non-overlapping. Hence, we can switch to innermost.

↳ QTRS
  ↳ Non-Overlap Check
QTRS
      ↳ DependencyPairsProof

Q restricted rewrite system:
The TRS R consists of the following rules:

-2(x, 0) -> x
-2(s1(x), s1(y)) -> -2(x, y)
+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
*2(x, 0) -> 0
*2(x, s1(y)) -> +2(x, *2(x, y))
p1(s1(x)) -> x
f1(s1(x)) -> f1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The set Q consists of the following terms:

-2(x0, 0)
-2(s1(x0), s1(x1))
+2(0, x0)
+2(s1(x0), x1)
*2(x0, 0)
*2(x0, s1(x1))
p1(s1(x0))
f1(s1(x0))


Q DP problem:
The TRS P consists of the following rules:

*12(x, s1(y)) -> +12(x, *2(x, y))
*12(x, s1(y)) -> *12(x, y)
-12(s1(x), s1(y)) -> -12(x, y)
+12(s1(x), y) -> +12(x, y)
F1(s1(x)) -> *12(s1(x), s1(x))
F1(s1(x)) -> P1(*2(s1(x), s1(x)))
F1(s1(x)) -> -12(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x)))
F1(s1(x)) -> F1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The TRS R consists of the following rules:

-2(x, 0) -> x
-2(s1(x), s1(y)) -> -2(x, y)
+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
*2(x, 0) -> 0
*2(x, s1(y)) -> +2(x, *2(x, y))
p1(s1(x)) -> x
f1(s1(x)) -> f1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The set Q consists of the following terms:

-2(x0, 0)
-2(s1(x0), s1(x1))
+2(0, x0)
+2(s1(x0), x1)
*2(x0, 0)
*2(x0, s1(x1))
p1(s1(x0))
f1(s1(x0))

We have to consider all minimal (P,Q,R)-chains.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
QDP
          ↳ DependencyGraphProof

Q DP problem:
The TRS P consists of the following rules:

*12(x, s1(y)) -> +12(x, *2(x, y))
*12(x, s1(y)) -> *12(x, y)
-12(s1(x), s1(y)) -> -12(x, y)
+12(s1(x), y) -> +12(x, y)
F1(s1(x)) -> *12(s1(x), s1(x))
F1(s1(x)) -> P1(*2(s1(x), s1(x)))
F1(s1(x)) -> -12(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x)))
F1(s1(x)) -> F1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The TRS R consists of the following rules:

-2(x, 0) -> x
-2(s1(x), s1(y)) -> -2(x, y)
+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
*2(x, 0) -> 0
*2(x, s1(y)) -> +2(x, *2(x, y))
p1(s1(x)) -> x
f1(s1(x)) -> f1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The set Q consists of the following terms:

-2(x0, 0)
-2(s1(x0), s1(x1))
+2(0, x0)
+2(s1(x0), x1)
*2(x0, 0)
*2(x0, s1(x1))
p1(s1(x0))
f1(s1(x0))

We have to consider all minimal (P,Q,R)-chains.
The approximation of the Dependency Graph contains 4 SCCs with 4 less nodes.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
QDP
                ↳ QDPAfsSolverProof
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

+12(s1(x), y) -> +12(x, y)

The TRS R consists of the following rules:

-2(x, 0) -> x
-2(s1(x), s1(y)) -> -2(x, y)
+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
*2(x, 0) -> 0
*2(x, s1(y)) -> +2(x, *2(x, y))
p1(s1(x)) -> x
f1(s1(x)) -> f1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The set Q consists of the following terms:

-2(x0, 0)
-2(s1(x0), s1(x1))
+2(0, x0)
+2(s1(x0), x1)
*2(x0, 0)
*2(x0, s1(x1))
p1(s1(x0))
f1(s1(x0))

We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

+12(s1(x), y) -> +12(x, y)
Used argument filtering: +12(x1, x2)  =  x1
s1(x1)  =  s1(x1)
Used ordering: Quasi Precedence: trivial


↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
                ↳ QDPAfsSolverProof
QDP
                    ↳ PisEmptyProof
              ↳ QDP
              ↳ QDP
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

-2(x, 0) -> x
-2(s1(x), s1(y)) -> -2(x, y)
+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
*2(x, 0) -> 0
*2(x, s1(y)) -> +2(x, *2(x, y))
p1(s1(x)) -> x
f1(s1(x)) -> f1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The set Q consists of the following terms:

-2(x0, 0)
-2(s1(x0), s1(x1))
+2(0, x0)
+2(s1(x0), x1)
*2(x0, 0)
*2(x0, s1(x1))
p1(s1(x0))
f1(s1(x0))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
QDP
                ↳ QDPAfsSolverProof
              ↳ QDP
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

*12(x, s1(y)) -> *12(x, y)

The TRS R consists of the following rules:

-2(x, 0) -> x
-2(s1(x), s1(y)) -> -2(x, y)
+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
*2(x, 0) -> 0
*2(x, s1(y)) -> +2(x, *2(x, y))
p1(s1(x)) -> x
f1(s1(x)) -> f1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The set Q consists of the following terms:

-2(x0, 0)
-2(s1(x0), s1(x1))
+2(0, x0)
+2(s1(x0), x1)
*2(x0, 0)
*2(x0, s1(x1))
p1(s1(x0))
f1(s1(x0))

We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

*12(x, s1(y)) -> *12(x, y)
Used argument filtering: *12(x1, x2)  =  x2
s1(x1)  =  s1(x1)
Used ordering: Quasi Precedence: trivial


↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
                ↳ QDPAfsSolverProof
QDP
                    ↳ PisEmptyProof
              ↳ QDP
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

-2(x, 0) -> x
-2(s1(x), s1(y)) -> -2(x, y)
+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
*2(x, 0) -> 0
*2(x, s1(y)) -> +2(x, *2(x, y))
p1(s1(x)) -> x
f1(s1(x)) -> f1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The set Q consists of the following terms:

-2(x0, 0)
-2(s1(x0), s1(x1))
+2(0, x0)
+2(s1(x0), x1)
*2(x0, 0)
*2(x0, s1(x1))
p1(s1(x0))
f1(s1(x0))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
QDP
                ↳ QDPAfsSolverProof
              ↳ QDP

Q DP problem:
The TRS P consists of the following rules:

-12(s1(x), s1(y)) -> -12(x, y)

The TRS R consists of the following rules:

-2(x, 0) -> x
-2(s1(x), s1(y)) -> -2(x, y)
+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
*2(x, 0) -> 0
*2(x, s1(y)) -> +2(x, *2(x, y))
p1(s1(x)) -> x
f1(s1(x)) -> f1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The set Q consists of the following terms:

-2(x0, 0)
-2(s1(x0), s1(x1))
+2(0, x0)
+2(s1(x0), x1)
*2(x0, 0)
*2(x0, s1(x1))
p1(s1(x0))
f1(s1(x0))

We have to consider all minimal (P,Q,R)-chains.
By using an argument filtering and a montonic ordering, at least one Dependency Pair of this SCC can be strictly oriented.

-12(s1(x), s1(y)) -> -12(x, y)
Used argument filtering: -12(x1, x2)  =  x2
s1(x1)  =  s1(x1)
Used ordering: Quasi Precedence: trivial


↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
                ↳ QDPAfsSolverProof
QDP
                    ↳ PisEmptyProof
              ↳ QDP

Q DP problem:
P is empty.
The TRS R consists of the following rules:

-2(x, 0) -> x
-2(s1(x), s1(y)) -> -2(x, y)
+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
*2(x, 0) -> 0
*2(x, s1(y)) -> +2(x, *2(x, y))
p1(s1(x)) -> x
f1(s1(x)) -> f1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The set Q consists of the following terms:

-2(x0, 0)
-2(s1(x0), s1(x1))
+2(0, x0)
+2(s1(x0), x1)
*2(x0, 0)
*2(x0, s1(x1))
p1(s1(x0))
f1(s1(x0))

We have to consider all minimal (P,Q,R)-chains.
The TRS P is empty. Hence, there is no (P,Q,R) chain.

↳ QTRS
  ↳ Non-Overlap Check
    ↳ QTRS
      ↳ DependencyPairsProof
        ↳ QDP
          ↳ DependencyGraphProof
            ↳ AND
              ↳ QDP
              ↳ QDP
              ↳ QDP
QDP

Q DP problem:
The TRS P consists of the following rules:

F1(s1(x)) -> F1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The TRS R consists of the following rules:

-2(x, 0) -> x
-2(s1(x), s1(y)) -> -2(x, y)
+2(0, y) -> y
+2(s1(x), y) -> s1(+2(x, y))
*2(x, 0) -> 0
*2(x, s1(y)) -> +2(x, *2(x, y))
p1(s1(x)) -> x
f1(s1(x)) -> f1(-2(p1(*2(s1(x), s1(x))), *2(s1(x), s1(x))))

The set Q consists of the following terms:

-2(x0, 0)
-2(s1(x0), s1(x1))
+2(0, x0)
+2(s1(x0), x1)
*2(x0, 0)
*2(x0, s1(x1))
p1(s1(x0))
f1(s1(x0))

We have to consider all minimal (P,Q,R)-chains.